Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity
نویسندگان
چکیده
منابع مشابه
Complexity of t-tautologies
A t-tautology (triangular tautology) is a propositional formula which is a tautology in all fuzzy logics deened by continuous triangular norms. In this paper we show that the problem of recognizing t-tautologies is coNP complete, and thus decidable.
متن کاملIntuitionistic vs. Classical Tautologies, Quantitative Comparison
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in the naming of variables are identical. For every n ∈ N, there is a finite number of different formulas of size n. For every n we consider the proportion between the number of intuitionistic tautologies of size n compared...
متن کاملUniform vs. Nonuniform Membership for Mildly Context-Sensitive Languages: A Brief Survey
Parsing for mildly context-sensitive language formalisms is an important area within natural language processing. While the complexity of the parsing problem for some such formalisms is known to be polynomial, this is not the case for all of them. This article presents a series of results regarding the complexity of parsing for linear context-free rewriting systems and deterministic tree-walkin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1984
ISSN: 0168-0072
DOI: 10.1016/0168-0072(84)90029-0